Method for bounded transactional timing analysis

ABSTRACT

A portion of a gate-level netlist representing an integrated circuit design is selected for optimization. A timing window representing the selected portion is made comprising one or more copies of the selected portion. A checkpoint is created for the timing window and stored in a transaction history. One or more changes are then made to the timing window and stored in the transaction history. The changed elements are marked as dirty and stored in the transaction history. After the one or more changes have been made, the timing window is queried for current timing conditions and compared with the checkpoint. If the one or more changes are an improvement, the one or more changes are committed by replicating the one or more changes to the portion of the gate-level netlist. If the one or more changes are not an improvement, the timing window may be restored to the checkpoint.

TECHNICAL FIELD

The present disclosure generally relates to the field of integratedcircuit design tools and more particularly to integrated circuitphysical synthesis tools.

BACKGROUND

In a design flow, a concept for an integrated circuit design istransformed into its final form. Physical synthesis is a stage in thedesign flow of an integrated circuit where a gate-level netlistrepresenting the integrated circuit design is utilized to optimize thephysical characteristics of the integrated circuit design. Thesecharacteristics may include timing, power, testability, signalintegrity, routability, and manufacturability. The physicalcharacteristics of the integrated circuit design may be optimizedsubject to assigning the gates in the netlist to non-overlappinglocations in the integrated circuit design.

Large-scale industrial static timing analysis (STA) engines are thebackbone for modern physical synthesis flows. STA engines typicallymaintain fault-tolerant graph-based structures in order to provide aglobal interface for components to query current timing conditions(e.g., to extract the critical paths of a network) and update the valuesof edges between existing nodes in the graph (e.g., to reflect there-powering or replacing of logical gates). STA engines are alsoresponsible for propagating timing information throughout the entirenetwork.

SUMMARY

A portion of a gate-level netlist representing an integrated circuitdesign may be selected for optimization. A change may be made duringphysical synthesis to a timing window representing the portion of thegate-level netlist representing the integrated circuit design. Currenttiming conditions of the timing window representing the portion of agate-level netlist representing an integrated circuit design may bequeried and the values of edges between existing nodes in a timing graphupdated. The computational expense of querying timing conditions of thetiming window representing the portion of a gate-level netlistrepresenting an integrated circuit design and updating the values ofedges between existing nodes in the timing graph may be proportional tothe size of the portion of a gate-level netlist representing anintegrated circuit design rather than the entire gate-level netlistrepresenting an integrated circuit design. Thus, less computation isrequired to query the timing window representing the portion of thegate-level netlist representing the integrated circuit design forcurrent timing conditions and update the values of edges betweenexisting nodes in the graph than the query the entire gate-level netlistrepresenting the integrated circuit design utilizing the same method ofquerying current timing conditions and updating the values of edgesbetween existing nodes in the graph, resulting in more efficientphysical synthesis.

The timing window may comprise a copy made of the portion of thegate-level netlist representing the integrated circuit design which hasbeen selected for optimization. Before one or more changes are made tothe copy of the portion of the gate-level netlist representing theintegrated circuit design, a checkpoint may be created. The checkpointmay be stored in a transaction history. As part of creating thecheckpoint, the copy of the portion of the gate-level netlistrepresenting the integrated circuit design may be queried for currenttiming conditions and the values of edges between existing nodes in thetiming graph may be determined. The timing graph may be stored in thetransaction history. One or more changes may then be made to the copy ofthe portion of the gate-level netlist representing the integratedcircuit design. The one or more changes may be stored in the transactionhistory. The changed elements of the copy of the portion of thegate-level netlist representing the integrated circuit design may bemarked as dirty (i.e. indicated that those elements have been changed).The elements that have been marked dirty may be stored in thetransaction history. After the one or more changes have been made to thecopy of the portion of the gate-level netlist representing theintegrated circuit design, the copy of the portion of the gate-levelnetlist representing the integrated circuit design may be queried forcurrent timing conditions and the values of edges between existing nodesin the timing graph may be updated. The timing conditions and values ofedges between existing nodes in the timing graph after the change may becompared with the timing conditions and the values of edges betweenexisting nodes in the timing graph stored in the transaction historyfrom prior to the change. It may be determined, based on the comparison,whether the one or more changes are an improvement.

If the one or more changes are an improvement, the one or more changesto the copy of the portion of the gate-level netlist representing theintegrated circuit design may be committed by replicating the one ormore changes to the portion of the gate-level netlist representing theintegrated circuit design utilizing the one or more changes stored inthe transaction history and/or the one or more dirty elements of thecopy of the portion of the gate-level netlist representing theintegrated circuit design stored in the transaction history. After theone or more changes to the copy of the portion of the gate-level netlistrepresenting the integrated circuit design are committed, the one ormore dirty elements of the copy of the portion of the gate-level netlistrepresenting the integrated circuit design may then be marked as clean(i.e. unchanged) and the checkpoint, the timing graph, the one or morechanges, and/or the elements that have been marked dirty may be deleted(i.e. removed) from the transaction history.

If the one or more changes are not an improvement, the copy of theportion of the gate-level netlist representing the integrated circuitdesign may be restored (i.e. rolled back) to the checkpoint stored inthe transaction history by undoing the one or more changes and bysetting the timing conditions and values of edges between existing nodesin the timing graph to the timing conditions and values of edges betweenexisting nodes in the timing graph previous to the one or more changes.The one or more changes may be undone utilizing the one or more changesstored in the transaction history and/or the one or more dirty elementsof the copy of the portion of the gate-level netlist representing theintegrated circuit design stored in the transaction history. The timingconditions and values of edges between existing nodes in the timinggraph may be set to the timing conditions and values of edges betweenexisting nodes in the timing graph previous to the one or more changesutilizing the timing graph may be stored in the transaction history.After the copy of the portion of the gate-level netlist representing theintegrated circuit design is restored to the checkpoint stored in thetransaction history, the one or more dirty elements of the copy of theportion of the gate-level netlist representing the integrated circuitdesign may then be marked as clean (i.e. unchanged) and the checkpoint,the timing graph, the one or more changes, and/or the elements that havebeen marked dirty may be deleted (i.e. removed) from the transactionhistory.

Although the present disclosure has been described utilizing a singlecheckpoint, it should be understood that multiple checkpoints may becreated and stored in the transaction history without departing from thescope of the present disclosure. In such a case, the copy of the portionof the gate-level netlist representing the integrated circuit design maybe restored to any of the checkpoints that have created and stored inthe transaction history, not just a checkpoint created and stored in thetransaction history immediately prior to one or more changes being madeto the copy of the portion of the gate-level netlist representing theintegrated circuit design.

Although the present disclosure has been described utilizing one copy ofthe portion of the gate-level netlist representing the integratedcircuit design, it should be understood that multiple copies may be madeand changes may be made to the multiple copies and evaluated inparallel. In this way, multiple optimization possibilities for theportion of the gate-level netlist representing the integrated circuitdesign may be concurrently explored.

It is to be understood that both the foregoing general description andthe following detailed description are exemplary and explanatory onlyand are not necessarily restrictive of the present disclosure. Theaccompanying drawings, which are incorporated in and constitute a partof the specification, illustrate subject matter of the disclosure.Together, the descriptions and the drawings serve to explain theprinciples of the disclosure.

BRIEF DESCRIPTION OF THE DRAWINGS

The numerous advantages of the disclosure may be better understood bythose skilled in the art by reference to the accompanying figures inwhich:

FIG. 1 is a diagram view illustrating a graphical representation ofphysical synthesis of an integrated circuit design represented by agate-level netlist;

FIG. 2 is a diagram view illustrating a graphical representation ofphysical synthesis of an integrated circuit design represented by agate-level netlist, in accordance with an embodiment of the presentdisclosure;

FIG. 3 is a flow chart illustrating an example of a flow of the processof the physical synthesis of FIG. 2, in accordance with an embodiment ofthe present disclosure;

FIG. 4 is a circuit diagram illustrating a change that may be made to acircuit during the physical synthesis of FIG. 2, in accordance with anembodiment of the present disclosure;

FIG. 5 is a circuit diagram illustrating a change that may be made to acircuit during the physical synthesis of FIG. 2, in accordance with anembodiment of the present disclosure;

FIG. 6 is a circuit diagram illustrating a change that may be made to acircuit during the physical synthesis of FIG. 2, in accordance with anembodiment of the present disclosure;

FIG. 7 is a circuit diagram illustrating a change that may be made to acircuit during the physical synthesis of FIG. 2, in accordance with anembodiment of the present disclosure;

FIG. 8 is a circuit diagram illustrating a change that may be made to acircuit during the physical synthesis of FIG. 2, in accordance with anembodiment of the present disclosure;

FIG. 9 is a flow diagram illustrating a method of physical synthesis ofan integrated circuit design represented by a gate-level netlist, inaccordance with an alternative embodiment of the present disclosure;

FIG. 10 is a flow diagram illustrating a method of physical synthesis ofan integrated circuit design represented by a gate-level netlist, inaccordance with an alternative embodiment of the present disclosure;

FIG. 11 is a flow diagram illustrating a method of physical synthesis ofan integrated circuit design represented by a gate-level netlist, inaccordance with an alternative embodiment of the present disclosure;

FIG. 12 is a flow diagram illustrating a method of physical synthesis ofan integrated circuit design represented by a gate-level netlist, inaccordance with an alternative embodiment of the present disclosure;

FIG. 13 is a flow diagram illustrating a method of physical synthesis ofan integrated circuit design represented by a gate-level netlist, inaccordance with an alternative embodiment of the present disclosure;

FIG. 14 is a flow diagram illustrating a method of physical synthesis ofan integrated circuit design represented by a gate-level netlist, inaccordance with an alternative embodiment of the present disclosure;

FIG. 15 is a flow diagram illustrating a method of physical synthesis ofan integrated circuit design represented by a gate-level netlist, inaccordance with an alternative embodiment of the present disclosure;

FIG. 16 is a flow diagram illustrating a method of physical synthesis ofan integrated circuit design represented by a gate-level netlist, inaccordance with an alternative embodiment of the present disclosure;

FIG. 17 is a flow diagram illustrating a method of physical synthesis ofan integrated circuit design represented by a gate-level netlist, inaccordance with an alternative embodiment of the present disclosure;

FIG. 18 is a flow diagram illustrating a method of physical synthesis ofan integrated circuit design represented by a gate-level netlist, inaccordance with an alternative embodiment of the present disclosure; and

FIG. 19 is a flow diagram illustrating a method of physical synthesis ofan integrated circuit design represented by a gate-level netlist, inaccordance with an alternative embodiment of the present disclosure.

DETAILED DESCRIPTION

Reference will now be made in detail to the subject matter disclosed,which is illustrated in the accompanying drawings.

Propagation of timing information by STA engines throughout the entirenetwork is typically deferred until absolutely necessary due to thecomputational expense. STA may be incremental, as the majority of atomicchanges made during synthesis affect only a local portion of the timinggraph. However, the level of support required to ensure trueincrementality increases as the sophistication of physical synthesistools increase. For example, “self-aware” transforms may be capable ofdetecting when predicted improvements result in unexpected degradations.It is inefficient if these transforms attempt extremely poor choices andpropagate these values beyond a local frontier where they will beultimately rejected. When these transforms detect that a predictedimprovement does result in an unexpected degradation, the state must berestored to the previously observed values.

STA engines may invalidate the entire fan-in (the portion of theintegrated circuit design leading to the changed portion) and fan-outcone (the portion of the integrated circuit design leading from thechanged portion) of any change to the logical or physical implementationof the integrated circuit design. As a result, current timing conditionsmay need to be queried and the values of edges between existing nodes inthe graph may need to be updated. This situation is inefficient, as onlytiming nearby a change may need to be queried to determine whether achange is an improvement and only a bounded region of the fan-in andfan-out may need to be invalidated. If the change is undone, the undoingof the change may simply be treated as a second change, and the entirefan-in and fan-out cones may again be invalidated. Current timingconditions may again need to be queried and the values of edges betweenexisting nodes in the graph may again need to be updated. This is alsoinefficient, as already known values may need to be re-computed.

FIG. 1 illustrates a graphical representation of physical synthesis 100of an integrated circuit design 101 represented by a gate-level netlist.Change 102 represents a change made during physical synthesis to thegate-level netlist representing the integrated circuit design 101.Timing cones 103 represent the fan-in and fan-out of the change madeduring the physical synthesis to the gate-level netlist representing theintegrated circuit design 101. Timing cones 103 illustrate thesubdivision of the gate-level netlist of the integrated circuit design101 that may need to be queried for current timing conditions and thevalues of edges between existing nodes in the graph updated.

FIG. 2 illustrates a graphical representation of physical synthesis 200of an integrated circuit design 201 represented by a gate-level netlist,in accordance with an embodiment of the present disclosure. Timingwindow 204 represents a portion of the gate-level netlist representingthe integrated circuit design 201 which has been selected foroptimization. The portion represented by timing window 204 may beselected from the gate-level netlist representing design 201 foroptimization based on a variety of criteria including, but not limitedto, the portion of the gate-level netlist representing design 201 thatmay require optimization, the portion of the gate-level netlistrepresenting design 201 that may be necessary to determine whether achange to the gate-level netlist should be rejected, and/or the portionof the gate-level netlist representing design 201 that may be affectedby a change to the gate-level netlist. Change 202 represents a changemade during physical synthesis to the timing window 204 representing theportion of the gate-level netlist representing the integrated circuitdesign 201. Timing cones 203 represent the fan-in and fan-out of thechange made during the physical synthesis to the timing window 204representing the portion of the gate-level netlist representing theintegrated circuit design 201. Timing cones 203 illustrate thesubdivision of timing window 204 representing the portion of thegate-level netlist of the integrated circuit design 201 that may need tobe queried for current timing conditions and the values of edges betweenexisting nodes in the graph updated. It can be seen by comparing FIGS. 1and 2 that timing cones 203 occupy a smaller subdivision of thegate-level netlist of the integrated circuit design 201 than timingcones 103 occupy of the gate-level netlist of the integrated circuitdesign 101. As such, less computation is required to query for currenttiming conditions and update the values of edges between existing nodesin the graph for change 202 than change 102 utilizing the same method ofquerying current timing conditions and updating the values of edgesbetween existing nodes in the graph. The computational expense of queryfor current timing conditions and update the values of edges betweenexisting nodes in the graph for change 202 may be proportional to thesize of timing window 204 rather than the entire gate-level netlistrepresenting the integrated circuit design 201. Thus, the efficiency ofthe physical synthesis 200 of the integrated circuit design 201 isimproved over the efficiency of the physical synthesis 100 of theintegrated circuit design 101.

The timing window 204 may comprise a copy made of the portion of thegate-level netlist representing the integrated circuit design 201 whichhas been selected for optimization. Before one or more changes are madeto the copy of the portion of the gate-level netlist representing theintegrated circuit design 201, a checkpoint may be created. Thecheckpoint may be stored in a transaction history. As part of creatingthe checkpoint, the copy of the portion of the gate-level netlistrepresenting the integrated circuit design 201 may be queried forcurrent timing conditions and the values of edges between existing nodesin the timing graph may be determined. The timing graph may be stored inthe transaction history. The timing graph may be stored in afirst-in-last-out (FIFO) data structure in the transaction historyincluding, but not limited to, a stack. One or more changes may then bemade to the copy of the portion of the gate-level netlist representingthe integrated circuit design 201. The one or more changes may be storedin the transaction history. The changed elements of the copy of theportion of the gate-level netlist representing the integrated circuitdesign 201 may be marked as dirty (i.e. indicated that those elementshave been changed). The elements that have been marked dirty may bestored in the transaction history.

After the one or more changes have been made to the copy of the portionof the gate-level netlist representing the integrated circuit design201, the copy of the portion of the gate-level netlist representing theintegrated circuit design 201 may be queried for current timingconditions and the values of edges between existing nodes in the timinggraph may be updated. The timing conditions and values of edges betweenexisting nodes in the timing graph after the change may be compared withthe timing conditions and the values of edges between existing nodes inthe timing graph stored in the transaction history from prior to thechange. It may be determined, based on the comparison, whether the oneor more changes are an improvement. The one or more changes may be animprovement if the timing conditions and values of edges betweenexisting nodes in the timing graph subsequent to the one or more changesmore closely conform to the timing constraints of the integrated circuitdesign 201 than the timing conditions and values of edges betweenexisting nodes in the timing graph previous to the one or more changes.The one or more changes may not be an improvement if the timingconditions and values of edges between existing nodes in the timinggraph subsequent to the one or more changes do not more closely conformto the timing constraints of the integrated circuit design 201 than thetiming conditions and values of edges between existing nodes in thetiming graph previous to the one or more changes.

If the one or more changes are an improvement, the one or more changesto the copy of the portion of the gate-level netlist representing theintegrated circuit design 201 may be committed by replicating the one ormore changes to the portion of the gate-level netlist representing theintegrated circuit design 201. The one or more changes to the copy ofthe portion of the gate-level netlist representing the integratedcircuit design 201 may be replicated to the portion of the gate-levelnetlist representing the integrated circuit design 201 utilizing the oneor more changes stored in the transaction history and/or the one or moredirty elements of the copy of the portion of the gate-level netlistrepresenting the integrated circuit design 201 stored in the transactionhistory. After the one or more changes to the copy of the portion of thegate-level netlist representing the integrated circuit design 201 arecommitted, the one or more dirty elements of the copy of the portion ofthe gate-level netlist representing the integrated circuit design 201may then be marked as clean (i.e. unchanged) and the checkpoint, thetiming graph, the one or more changes, and/or the elements that havebeen marked dirty may be deleted (i.e. removed) from the transactionhistory.

If the one or more changes are not an improvement, the copy of theportion of the gate-level netlist representing the integrated circuitdesign 201 may be restored (i.e. rolled back) to the checkpoint storedin the transaction history. The copy of the portion of the gate-levelnetlist representing the integrated circuit design 201 may be restoredto the checkpoint stored in the transaction history by undoing the oneor more changes and by setting the timing conditions and values of edgesbetween existing nodes in the timing graph to the timing conditions andvalues of edges between existing nodes in the timing graph previous tothe one or more changes. The one or more changes may be undone utilizingthe one or more changes stored in the transaction history and/or the oneor more dirty elements of the copy of the portion of the gate-levelnetlist representing the integrated circuit design 201 stored in thetransaction history. Alternatively, the one or more changes may beundone by not committing to the copy of the portion of the gate-levelnetlist representing the integrated circuit design 201 (i.e. by notreplicating the one or more changes to the portion of the gate-levelnetlist representing the integrated circuit design 201). The timingconditions and values of edges between existing nodes in the timinggraph may be set to the timing conditions and values of edges betweenexisting nodes in the timing graph previous to the one or more changesutilizing the timing graph may be stored in the transaction history.After the copy of the portion of the gate-level netlist representing theintegrated circuit design 201 is restored to the checkpoint stored inthe transaction history, the one or more dirty elements of the copy ofthe portion of the gate-level netlist representing the integratedcircuit design 201 may then be marked as clean (i.e. unchanged) and thecheckpoint, the timing graph, the one or more changes, and/or theelements that have been marked dirty may be deleted (i.e. removed) fromthe transaction history.

Although the present disclosure has been described utilizing a singlecheckpoint, it should be understood that multiple checkpoints may becreated and stored in the transaction history without departing from thescope of the present disclosure. In such a case, the copy of the portionof the gate-level netlist representing the integrated circuit design 201may be restored to any of the checkpoints that have created and storedin the transaction history, not just a checkpoint created and stored inthe transaction history immediately prior to one or more changes beingmade to the copy of the portion of the gate-level netlist representingthe integrated circuit design 201.

Although the present disclosure has been described utilizing one copy ofthe portion of the gate-level netlist representing the integratedcircuit design 201 which has been selected for optimization, it shouldbe understood that multiple copies may be made and changes may be madeto the multiple copies and evaluated in parallel. In this way, multipleoptimization possibilities for the portion of the gate-level netlistrepresenting the integrated circuit design which has been selected foroptimization may be concurrently explored.

Although the present disclosure has been described utilizing one or morecopies of the portion of the gate-level netlist representing theintegrated circuit design 201 which has been selected for optimizationwhich are then changed and evaluated, it should be understood that thetiming window 204 may comprise one or more memory structures thatsequentially record changes as differences from the portion of thegate-level netlist representing the integrated circuit design 201 whichhas been selected for optimization without departing from the scope ofthe present disclosure. The one or more memory structures may comprise adifference stack. Each difference stack may then represent a series ofdifferences from the portion of the gate-level netlist representing theintegrated circuit design 201 which has been selected for optimization(and/or another difference stack) and may each be evaluated to see ifthe differences represented by the difference stack were an improvement.

The physical synthesis 200 of an integrated circuit design 201represented by a gate-level netlist illustrated in FIG. 2 may beperformed by computer readable instructions stored on a tangiblecomputer usable medium and/or a tangible computer readable mediumincluding, but not limited to, a tangible computer readable storagemedium. The tangible computer readable storage medium may include, butis not limited to a hard disk drive, a solid state drive, an opticalstorage medium, a memory, a random access memory, a read only memory, aflash memory, a cache memory, an optical disk, a floppy disk, auniversal serial bus drive, a register, paper tape, a punch card, a ramdisk, a ZIP disk, magnetic tape, volatile memory, non-volatile memory,dynamic memory, static memory, dynamic random access memory, synchronousdynamic random access memory, and/or a tape cartridge.

FIG. 3 is a flow chart illustrating an example of a flow of the processof the physical synthesis 200 of FIG. 2, in accordance with anembodiment of the present disclosure. The process may begin at a start301. After start 301, a portion of a gate-level netlist representing anintegrated circuit design may be selected 302. Then, a copy of theportion of a gate-level netlist representing an integrated circuitdesign may be created 303. After the copy of the portion of a gate-levelnetlist representing an integrated circuit design has been created 303,an existing copy of the portion of the gate-level netlist representingan integrated circuit design may be selected 304 and a checkpoint may becreated 305. The checkpoint may be stored to transaction history 319.After a checkpoint is created 305, the copy of the portion of thegate-level netlist representing the integrated circuit design may bemodified 306 and the changed elements of the copy of the portion of thegate-level netlist representing the integrated circuit design may bemarked as dirty 307. After the copy of the portion of the gate-levelnetlist representing the integrated circuit design is modified 306 andthe changed elements of the copy of the portion of the gate-levelnetlist representing the integrated circuit design are marked as dirty307, the timing of the copy of the portion of the gate-level netlistrepresenting the integrated circuit design may be queried 308. Then, itmay be determine whether to evaluate whether the modification is animprovement 309.

If it is not determined to evaluate whether the modification is animprovement 309, it may be determined whether to create a new checkpoint310. If it is determined to create another checkpoint 310, a checkpointmay be created 305. If it is not determined to create another checkpoint310, the copy of the portion of the gate-level netlist representing theintegrated circuit design may be modified 306.

If it is determined to evaluate whether the modification is animprovement 309, it may be determined whether to retract themodification 311 by comparing the timing of the copy of the portion ofthe gate-level netlist representing the integrated circuit design withthe checkpoint. If it is determined to retract the modification 311, themodification is undone 312. Then the timing values are undone 313, theelements of the copy of the portion of the gate-level netlistrepresenting the integrated circuit design marked as dirty are changedto clean 314, and the checkpoint is deleted 315. The checkpoint may bedeleted from transaction history 319. After the checkpoint is deleted315, it may be determined whether to continue optimization 316. If it isdetermined to continue optimization 316, it may be determined whether tooptimize an existing copy of the portion of the gate-level netlistrepresenting an integrated circuit design 320. If it is not determinedto optimize an existing copy of the portion of the gate-level netlistrepresenting an integrated circuit design 320, a copy of the portion ofa gate-level netlist representing an integrated circuit design may becreated 303. If it is determined to optimize an existing copy of theportion of the gate-level netlist representing an integrated circuitdesign 320, an existing copy of the portion of the gate-level netlistrepresenting an integrated circuit design may be selected 304 and acheckpoint may be created 305. Thus, multiple copies of the portion ofthe gate-level netlist representing an integrated circuit design may bechanged and evaluated in parallel. If it is not determined to continueoptimization 316, any modifications may be committed to the integratedcircuit design 317. After any modifications have been committed to theintegrated circuit design 317, the process may terminate 318. If it isnot determined to evaluate whether the modification is an improvement309, it may be determined whether to continue optimization 316.

FIGS. 4 through 8 are circuit diagrams 400 illustrating example changesthat may be made to circuit 400 which represents portion 204 of FIG. 2during physical synthesis 200, in accordance with an embodiment of thepresent disclosure. It should be noted that FIGS. 4 through 8 merelyprovide examples of changes and are in no way intended to restrict thechanges that may be made to portion 204 of FIG. 2 during physicalsynthesis 200 of the integrated circuit design 201 represented by agate-level netlist in accordance with the present disclosure.

In FIG. 4, circuit 401 includes latch 402. In FIG. 5, circuit 401 hasbeen changed from FIG. 4 by moving latch 402. In FIG. 6, circuit 401 hasbeen changed from FIG. 5 by the insertion of buffer 403. In FIG. 7,circuit 401 has been changed from FIG. 6 by the removal of buffer 403.Buffer 403 may have been removed from circuit 401 because a comparisonof a timing query of circuit 401 as illustrated in FIG. 6 revealed itwas not an improvement over circuit 401 as illustrated in FIG. 5. Alsoin FIG. 7, circuit 401 has also been changed from FIG. 6 by the resizingof latch 402 (replacing latch 402 with larger latch 402) and. In FIG. 8,circuit 401 has been changed from FIG. 7 by the insertion of buffer 405.

As will be appreciated by one skilled in the art, the present disclosuremay be embodied as a system, method or computer program product.Accordingly, the present disclosure may take the form of an entirelyhardware embodiment, an entirely software embodiment (includingfirmware, resident software, micro-code, etc.) or an embodimentcombining software and hardware aspects that may all generally bereferred to herein as a “circuit,” “module” or “system.” Furthermore,the present disclosure may take the form of a computer program productembodied in any tangible medium of expression having computer-usableprogram code embodied in the medium.

Any combination of one or more computer usable or computer readablemedium(s) may be utilized. The computer-usable or computer-readablemedium may be, for example but not limited to, an electronic, magnetic,optical, electromagnetic, infrared, or semiconductor system, apparatus,device, or propagation medium. More specific examples (a non-exhaustivelist) of the computer-readable medium would include the following: anelectrical connection having one or more wires, a portable computerdiskette, a hard disk, a random access memory (RAM), a read-only memory(ROM), an erasable programmable read-only memory (EPROM or Flashmemory), an optical fiber, a portable compact disc read-only memory(CD-ROM), an optical storage device, a transmission media such as thosesupporting the Internet or an intranet, or a magnetic storage device.Note that the computer-usable or computer-readable medium could even bepaper or another suitable medium upon which the program is printed, asthe program can be electronically captured, via, for instance, opticalscanning of the paper or other medium, then compiled, interpreted, orotherwise processed in a suitable manner, if necessary, and then storedin a computer memory. In the context of this document, a computer-usableor computer-readable medium may be any medium that can contain, store,communicate, propagate, or transport the program for use by or inconnection with the instruction execution system, apparatus, or device.The computer-usable medium may include a propagated data signal with thecomputer-usable program code embodied therewith, either in baseband oras part of a carrier wave. The computer usable program code may betransmitted using any appropriate medium, including but not limited towireless, wireline, optical fiber cable, RF, etc.

Computer program code for carrying out operations of the presentdisclosure may be written in any combination of one or more programminglanguages, including an object oriented programming language such asJava, Smalltalk, C++ or the like and conventional procedural programminglanguages, such as the “C” programming language or similar programminglanguages. The program code may execute entirely on the user's computer,partly on the user's computer, as a stand-alone software package, partlyon the user's computer and partly on a remote computer or entirely onthe remote computer or server. In the latter scenario, the remotecomputer may be connected to the user's computer through any type ofnetwork, including a local area network (LAN) or a wide area network(WAN), or the connection may be made to an external computer (forexample, through the Internet using an Internet Service Provider).

The present disclosure is described below with reference to flowchartillustrations and/or block diagrams of methods, apparatus (systems) andcomputer program products according to embodiments of the disclosure. Itwill be understood that each block of the flowchart illustrations and/orblock diagrams, and combinations of blocks in the flowchartillustrations and/or block diagrams, can be implemented by computerprogram instructions. These computer program instructions may beprovided to a processor of a general purpose computer, special purposecomputer, or other programmable data processing apparatus to produce amachine, such that the instructions, which execute via the processor ofthe computer or other programmable data processing apparatus, createmeans for implementing the functions/acts specified in the flowchartand/or block diagram block or blocks.

These computer program instructions may also be stored in acomputer-readable medium that can direct a computer or otherprogrammable data processing apparatus to function in a particularmanner, such that the instructions stored in the computer-readablemedium produce an article of manufacture including instruction meanswhich implement the function/act specified in the flowchart and/or blockdiagram block or blocks.

The computer program instructions may also be loaded onto a computer orother programmable data processing apparatus to cause a series ofoperational steps to be performed on the computer or other programmableapparatus to produce a computer implemented process such that theinstructions which execute on the computer or other programmableapparatus provide processes for implementing the functions/actsspecified in the flowchart and/or block diagram block or blocks.

FIG. 9 illustrates a method of physical synthesis of an integratedcircuit design represented by a gate-level netlist, in accordance withan alternative embodiment of the present disclosure. In step 901,receive a netlist representing a design for an integrated circuit toperform physical synthesis upon the design for the integrated circuit.In step 902, select a portion of the netlist corresponding to a portionof the design for the integrated circuit to be optimized. In step 903,evaluate a pre-change timing of a timing window representing the portionof the netlist while performing the physical synthesis. In step 904,perform a change to the timing window representing the portion of thenetlist while performing the physical synthesis.

FIG. 10 illustrates a method of physical synthesis of an integratedcircuit design represented by a gate-level netlist, in accordance withan alternative embodiment of the present disclosure. In step 1001,receive a netlist representing a design for an integrated circuit toperform physical synthesis upon the design for the integrated circuit.In step 1002, select a portion of the netlist corresponding to a portionof the design for the integrated circuit to be optimized. In step 1003,create a checkpoint in a transaction history while performing thephysical synthesis. In step 1004, evaluate a pre-change timing of atiming window representing the portion of the netlist while performingthe physical synthesis. In step 1005, store the pre-change timing andthe change in the transaction history. In step 1006, perform a change tothe timing window representing the portion of the netlist whileperforming the physical synthesis.

FIG. 11 illustrates a method of physical synthesis of an integratedcircuit design represented by a gate-level netlist, in accordance withan alternative embodiment of the present disclosure. In step 1101,receive a netlist representing a design for an integrated circuit toperform physical synthesis upon the design for the integrated circuit.In step 1102, select a portion of the netlist corresponding to a portionof the design for the integrated circuit to be optimized. In step 1103,create a checkpoint in a transaction history while performing thephysical synthesis. In step 1104, evaluate a pre-change timing of atiming window representing the portion of the netlist while performingthe physical synthesis. In step 1105, store the pre-change timing andthe change in the transaction history. In step 1106, perform a change tothe timing window representing the portion of the netlist whileperforming the physical synthesis. In step 1107, determine that apost-change timing of the timing window representing the portion of thenetlist is not an improvement over the pre-change timing. In step 1108,restore the timing window representing the portion of the netlist to thecheckpoint by retracting the change utilizing the stored change from thetransaction history and setting the post-change timing of the timingwindow representing the portion of the netlist to the pre-change timingutilizing the stored pre-change timing from the transaction history.

FIG. 12 illustrates a method of physical synthesis of an integratedcircuit design represented by a gate-level netlist, in accordance withan alternative embodiment of the present disclosure. In step 1201,receive a netlist representing a design for an integrated circuit toperform physical synthesis upon the design for the integrated circuit.In step 1202, select a portion of the netlist corresponding to a portionof the design for the integrated circuit to be optimized. In step 1203,create a checkpoint in a transaction history while performing thephysical synthesis. In step 1204, evaluate a pre-change timing of atiming window representing the portion of the netlist while performingthe physical synthesis. In step 1205, store the pre-change timing andthe change in the transaction history. In step 1206, perform a change tothe timing window representing the portion of the netlist whileperforming the physical synthesis. In step 1207, determine that apost-change timing of the timing window representing the portion of thenetlist is not an improvement over the pre-change timing. In step 1208restore the timing window representing the portion of the netlist to thecheckpoint by retracting the change utilizing the stored change from thetransaction history and setting the post-change timing of the timingwindow representing the portion of the netlist to the pre-change timingutilizing the stored pre-change timing from the transaction history. Instep 1209, delete the stored pre-change timing from the transactionhistory, the stored change from the transaction history, and thecheckpoint from the transaction history.

FIG. 13 illustrates a method of physical synthesis of an integratedcircuit design represented by a gate-level netlist, in accordance withan alternative embodiment of the present disclosure. In step 1301,receive a netlist representing a design for an integrated circuit toperform physical synthesis upon the design for the integrated circuit.In step 1302, select a portion of the netlist corresponding to a portionof the design for the integrated circuit to be optimized. In step 1303,create a checkpoint in a transaction history while performing thephysical synthesis. In step 1304, evaluate a pre-change timing of atiming window representing the portion of the netlist while performingthe physical synthesis. In step 1305, store the pre-change timing andthe change in the transaction history. In step 1306, perform a change tothe timing window representing the portion of the netlist whileperforming the physical synthesis. In step 1307, determine that apost-change timing of the timing window representing the portion of thenetlist is an improvement over the pre-change timing. In step 1308,update the netlist utilizing the stored change from the transactionhistory.

FIG. 14 illustrates a method of physical synthesis of an integratedcircuit design represented by a gate-level netlist, in accordance withan alternative embodiment of the present disclosure. In step 1401,receive a netlist representing a design for an integrated circuit toperform physical synthesis upon the design for the integrated circuit.In step 1402, select a portion of the netlist corresponding to a portionof the design for the integrated circuit to be optimized. In step 1403,create a checkpoint in a transaction history while performing thephysical synthesis. In step 1404, evaluate a pre-change timing of atiming window representing the portion of the netlist while performingthe physical synthesis. In step 1405, store the pre-change timing andthe change in the transaction history. In step 1406, perform a change tothe timing window representing the portion of the netlist whileperforming the physical synthesis. In step 1407, create an additionalcheckpoint in the transaction history while performing the physicalsynthesis. In step 1408, perform an additional change to the timingwindow representing the portion of the netlist while performing thephysical synthesis. In step 1409, store the additional change in thetransaction history. In step 1410, determine that a post-additionalchange timing of the timing window representing the portion of thenetlist is not an improvement over the pre-change timing. In step 1411,restore the timing window representing the portion of the netlist to thecheckpoint by retracting the additional change utilizing the storedadditional change from the transaction history, retracting the changeutilizing the stored change from the transaction history, and settingthe post-additional change timing of the timing window representing theportion of the netlist to the pre-change timing utilizing the storedpre-change timing from the transaction history.

FIG. 15 illustrates a method of physical synthesis of an integratedcircuit design represented by a gate-level netlist, in accordance withan alternative embodiment of the present disclosure. In step 1501,receive a netlist representing a design for an integrated circuit toperform physical synthesis upon the design for the integrated circuit.In step 1502, select a portion of the netlist corresponding to a portionof the design for the integrated circuit to be optimized. In step 1503,create a checkpoint in a transaction history while performing thephysical synthesis. In step 1504, store a pre-change timing of a timingwindow representing the portion of the netlist in the transactionhistory. In step 1505, perform a change to the timing windowrepresenting the portion of the netlist. In step 1506, store the changein the transaction history.

FIG. 16 illustrates a method of physical synthesis of an integratedcircuit design represented by a gate-level netlist, in accordance withan alternative embodiment of the present disclosure. In step 1601,receive a netlist representing a design for an integrated circuit toperform physical synthesis upon the design for the integrated circuit.In step 1602, select a portion of the netlist corresponding to a portionof the design for the integrated circuit to be optimized. In step 1603,create a checkpoint in a transaction history while performing thephysical synthesis. In step 1604, store a pre-change timing of a timingwindow representing the portion of the netlist in the transactionhistory. In step 1605, perform a change to the timing windowrepresenting the portion of the netlist. In step 1606, store the changein the transaction history. In step 1607, determine that a post-changetiming of the timing window representing the portion of the netlist isnot an improvement over the pre-change timing. In step 1608, restore thetiming window representing the portion of the netlist to the checkpointby retracting the change utilizing the stored change from thetransaction history and setting the post-change timing of the timingwindow representing the portion of the netlist to the pre-change timingutilizing the stored pre-change timing from the transaction history.

FIG. 17 illustrates a method of physical synthesis of an integratedcircuit design represented by a gate-level netlist, in accordance withan alternative embodiment of the present disclosure. In step 1701,receive a netlist representing a design for an integrated circuit toperform physical synthesis upon the design for the integrated circuit.In step 1702, select a portion of the netlist corresponding to a portionof the design for the integrated circuit to be optimized. In step 1703,create a checkpoint in a transaction history while performing thephysical synthesis. In step 1704, store a pre-change timing of a timingwindow representing the portion of the netlist in the transactionhistory. In step 1705, perform a change to the timing windowrepresenting the portion of the netlist. In step 1706, store the changein the transaction history. In step 1707, determine that a post-changetiming of the timing window representing the portion of the netlist isnot an improvement over the pre-change timing. In step 1708, restore thetiming window representing the portion of the netlist to the checkpointby retracting the change utilizing the stored change from thetransaction history and setting the post-change timing of the timingwindow representing the portion of the netlist to the pre-change timingutilizing the stored pre-change timing from the transaction history. Instep 1709, delete the stored pre-change timing from the transactionhistory, the stored change from the transaction history, and thecheckpoint from the transaction history.

FIG. 18 illustrates a method of physical synthesis of an integratedcircuit design represented by a gate-level netlist, in accordance withan alternative embodiment of the present disclosure. In step 1801,receive a netlist representing a design for an integrated circuit toperform physical synthesis upon the design for the integrated circuit.In step 1802, select a portion of the netlist corresponding to a portionof the design for the integrated circuit to be optimized. In step 1803,create a checkpoint in a transaction history while performing thephysical synthesis. In step 1804, store a pre-change timing of a timingwindow representing the portion of the netlist in the transactionhistory. In step 1805, perform a change to the timing windowrepresenting the portion of the netlist. In step 1806, store the changein the transaction history. In step 1807, determine that a post-changetiming of the timing window representing the portion of the netlist isan improvement over the pre-change timing. In step 1808, update thenetlist utilizing the stored change from the transaction history.

FIG. 19 illustrates a method of physical synthesis of an integratedcircuit design represented by a gate-level netlist, in accordance withan alternative embodiment of the present disclosure. In step 1901,receive a netlist representing a design for an integrated circuit toperform physical synthesis upon the design for the integrated circuit.In step 1902, select a portion of the netlist corresponding to a portionof the design for the integrated circuit to be optimized. In step 1903,create a checkpoint in a transaction history while performing thephysical synthesis. In step 1904, store a pre-change timing of a timingwindow representing the portion of the netlist in the transactionhistory. In step 1905, perform a change to the timing windowrepresenting the portion of the netlist. In step 1906, store the changein the transaction history. In step 1907, create an additionalcheckpoint in the transaction history while performing the physicalsynthesis. In step 1908, perform an additional change to the timingwindow representing the portion of the netlist. In step 1909, store theadditional change in the transaction history. In step 1910, determinethat a post-additional change timing of the timing window representingthe portion of the netlist is not an improvement over the pre-changetiming. In step 1911, restore the timing window representing the portionof the netlist to the checkpoint by retracting the additional changeutilizing the stored additional change from the transaction history,retracting the change utilizing the stored change from the transactionhistory, and setting the post-additional change timing of the timingwindow representing the portion of the netlist to the pre-change timingutilizing the stored pre-change timing from the transaction history.

The flowchart and block diagrams in the Figures illustrate thearchitecture, functionality, and operation of possible implementationsof systems, methods and computer program products according to variousembodiments of the present disclosure. In this regard, each block in theflowchart or block diagrams may represent a module, segment, or portionof code, which comprises one or more executable instructions forimplementing the specified logical function(s). It should also be notedthat, in some alternative implementations, the functions noted in theblock may occur out of the order noted in the figures. For example, twoblocks shown in succession may, in fact, be executed substantiallyconcurrently, or the blocks may sometimes be executed in the reverseorder, depending upon the functionality involved. It will also be notedthat each block of the block diagrams and/or flowchart illustration, andcombinations of blocks in the block diagrams and/or flowchartillustration, can be implemented by special purpose hardware-basedsystems that perform the specified functions or acts, or combinations ofspecial purpose hardware and computer instructions.

In the present disclosure, the methods disclosed may be implemented assets of instructions or software readable by a device. Further, it isunderstood that the specific order or hierarchy of steps in the methodsdisclosed are examples of exemplary approaches. Based upon designpreferences, it is understood that the specific order or hierarchy ofsteps in the method can be rearranged while remaining within thedisclosed subject matter. The accompanying method claims presentelements of the various steps in a sample order, and are not necessarilymeant to be limited to the specific order or hierarchy presented.

The terminology used herein is for the purpose of describing particularembodiments only and is not intended to be limiting of the disclosure.As used herein, the singular forms “a”, “an” and “the” are intended toinclude the plural forms as well, unless the context clearly indicatesotherwise. It will be further understood that the terms “comprises”and/or “comprising,” when used in this specification, specify thepresence of stated features, integers, steps, operations, elements,and/or components, but do not preclude the presence or addition of oneor more other features, integers, steps, operations, elements,components, and/or groups thereof.

The corresponding structures, materials, acts, and equivalents of allmeans or step plus function elements in the claims below are intended toinclude any structure, material, or act for performing the function incombination with other claimed elements as specifically claimed. Thedescription of the present disclosure has been presented for purposes ofillustration and description, but is not intended to be exhaustive orlimited to the disclosure in the form disclosed. Many modifications andvariations will be apparent to those of ordinary skill in the artwithout departing from the scope and spirit of the disclosure. Theembodiment was chosen and described in order to best explain theprinciples of the disclosure and the practical application, and toenable others of ordinary skill in the art to understand the disclosurefor various embodiments with various modifications as are suited to theparticular use contemplated.

It is believed that the present disclosure and many of its attendantadvantages will be understood by the foregoing description, and it willbe apparent that various changes may be made in the form, constructionand arrangement of the components without departing from the disclosedsubject matter or without sacrificing all of its material advantages.The form described is merely explanatory, and it is the intention of thefollowing claims to encompass and include such changes.

What is claimed is:
 1. A method, comprising: using a computer orprocessor to perform the steps of receiving a netlist representing adesign for an integrated circuit to perform physical synthesis upon thedesign for the integrated circuit; selecting a portion of the netlistcorresponding to a portion of the design for the integrated circuit tobe optimized; evaluating a pre-change timing of a timing windowrepresenting the portion of the netlist while performing the physicalsynthesis; performing a change to the timing window representing theportion of the netlist while performing the physical synthesis; creatinga checkpoint in a transaction history while performing the physicalsynthesis; and storing the pre-change timing and the change in thetransaction history.
 2. The method of claim 1, further comprising:determining that a post-change timing of the timing window representingthe portion of the netlist is not an improvement over the pre-changetiming; and restoring the timing window representing the portion of thenetlist to the checkpoint by retracting the change utilizing the storedchange from the transaction history and setting the post-change timingof the timing window representing the portion of the netlist to thepre-change timing utilizing the stored pre-change timing from thetransaction history.
 3. The method of claim 2, further comprising:deleting the stored pre-change timing from the transaction history, thestored change from the transaction history, and the checkpoint from thetransaction history.
 4. The method of claim 1, further comprising:determining that a post-change timing of the timing window representingthe portion of the netlist is an improvement over the pre-change timing;and updating the netlist utilizing the stored change from thetransaction history.
 5. The method of claim 1, further comprising:creating an additional checkpoint in the transaction history whileperforming the physical synthesis; performing an additional change tothe timing window representing the portion of the netlist whileperforming the physical synthesis; storing the additional change in thetransaction history; determining that a post-additional change timing ofthe timing window representing the portion of the netlist is not animprovement over the pre-change timing; and restoring the timing windowrepresenting the portion of the netlist to the checkpoint by retractingthe additional change utilizing the stored additional change from thetransaction history, retracting the change utilizing the stored changefrom the transaction history, and setting the post-additional changetiming of the timing window representing the portion of the netlist tothe pre-change timing utilizing the stored pre-change timing from thetransaction history.
 6. A method, comprising: using a computer orprocessor to perform the steps of receiving a netlist representing adesign for an integrated circuit to perform physical synthesis upon thedesign for the integrated circuit; selecting a portion of the netlistcorresponding to a portion of the design for the integrated circuit tobe optimized; creating a checkpoint in a transaction history whileperforming the physical synthesis; storing a pre-change timing of atiming window representing the portion of the netlist in the transactionhistory; performing a change to the timing window representing theportion of the netlist; storing the change in the transaction history;determining that a post-change timing of the timing window representingthe portion of the netlist is not an improvement over the pre-changetiming; and restoring the timing window representing the portion of thenetlist to the checkpoint by retracting the change utilizing the storedchange from the transaction history and setting the post-change timingof the timing window representing the portion of the netlist to thepre-change timing utilizing the stored pre-change timing from thetransaction history.
 7. The method of claim 6, further comprising:deleting the stored pre-change timing from the transaction history, thestored change from the transaction history, and the checkpoint from thetransaction history.
 8. The method of claim 6, further comprising:determining that a post-change timing of the timing window representingthe portion of the netlist is an improvement over the pre-change timing;and updating the netlist utilizing the stored change from thetransaction history.
 9. The method of claim 6, further comprising:creating an additional checkpoint in the transaction history whileperforming the physical synthesis; performing an additional change tothe timing window representing the portion of the netlist; storing theadditional change in the transaction history; determining that apost-additional change timing of the timing window representing theportion of the netlist is not an improvement over the pre-change timing;restoring the timing window representing the portion of the netlist tothe checkpoint by retracting the additional change utilizing the storedadditional change from the transaction history, retracting the changeutilizing the stored change from the transaction history, and settingthe post-additional change timing of the timing window representing theportion of the netlist to the pre-change timing utilizing the storedpre-change timing from the transaction history.
 10. A computer programproduct for bounded transactional timing analysis, the computer programproduct comprising: a tangible computer usable storage medium havingcomputer usable code tangibly embodied therewith, the computer usableprogram code comprising: computer usable program code configured toreceive a netlist representing a design for an integrated circuit toperform physical synthesis upon the design for the integrated circuit;computer usable program code configured to select a portion of thenetlist corresponding to a portion of the design for the integratedcircuit to be optimized; computer usable program code configured toevaluate a pre-change timing of a timing window representing the portionof the netlist while performing the physical synthesis; computer usableprogram code configured to perform a change to the timing windowrepresenting the portion of the netlist while performing the physicalsynthesis; computer usable program code configured to create acheckpoint in a transaction history while performing the physicalsynthesis; computer usable program code configured to store thepre-change timing of the change in the transaction history; computerusable program code configured to determine that a post-change timing ofthe timing window representing the portion of the netlist is not animprovement over the pre-change timing; and computer usable program codeconfigured to restore the timing window representing the portion of thenetlist to the checkpoint by retracting the change utilizing the storedchange from the transaction history and setting the post-change timingof the timing window representing the portion of the netlist to thepre-change timing utilizing the stored pre-change timing from thetransaction history.
 11. The computer program product of claim 10,further comprising: computer usable program code configured to deletethe stored pre-change timing from the transaction history, the storedchange from the transaction history, and the checkpoint from thetransaction history.
 12. The computer program product of claim 10,further comprising: computer usable program code configured to determinethat a post-change timing of the timing window representing the portionof the netlist is an improvement over the pre-change timing; andcomputer usable program code configured to update the netlist utilizingthe stored change from the transaction history.
 13. The computer programproduct of claim 10, further comprising: computer usable program codeconfigured to create an additional checkpoint in the transaction historywhile performing the physical synthesis; computer usable program codeconfigured to perform an additional change to the timing windowrepresenting the portion of the netlist while performing the physicalsynthesis; computer usable program code configured to store theadditional change in the transaction history; computer usable programcode configured to determine that a post-additional change timing of thetiming window representing the portion of the netlist is not animprovement over the pre-change timing; computer usable program codeconfigured to restore the timing window representing the portion of thenetlist to the checkpoint by retracting the additional change utilizingthe stored additional change from the transaction history, retractingthe change utilizing the stored change from the transaction history, andsetting the post-additional change timing of the timing windowrepresenting the portion of the netlist to the pre-change timingutilizing the stored pre-change timing from the transaction history. 14.A computer program product for bounded transactional timing analysis,the computer program product comprising: a tangible computer usablestorage medium having computer usable code tangibly embodied therewith,the computer usable program code comprising: computer usable programcode configured to receive a netlist representing a design for anintegrated circuit to perform physical synthesis upon the design for theintegrated circuit; computer usable program code configured to select aportion of the netlist corresponding to a portion of the design for theintegrated circuit to be optimized; computer usable program codeconfigured to create a checkpoint in a transaction history whileperforming the physical synthesis; computer usable program codeconfigured to store a pre-change timing of a timing window representingthe portion of the netlist in the transaction history; computer usableprogram code configured to perform a change to the timing windowrepresenting the portion of the netlist; computer usable program codeconfigured to store the change in the transaction history; computerusable program code configured to determine that a post-change timing ofthe timing window representing the portion of the netlist is not animprovement over the pre-change timing; and computer usable program codeconfigured to restore the timing window representing the portion of thenetlist to the checkpoint by retracting the change utilizing the storedchange from the transaction history and setting the post-change timingof the timing window representing the portion of the netlist to thepre-change timing utilizing the stored pre-change timing from thetransaction history.
 15. The computer program product of claim 14,further comprising: computer usable program code configured to deletethe stored pre-change timing from the transaction history, the storedchange from the transaction history, and the checkpoint from thetransaction history.
 16. The computer program product of claim 14,further comprising: computer usable program code configured to determinethat a post-change timing of the timing window representing the portionof the netlist is an improvement over the pre-change timing; andcomputer usable program code configured to update the netlist utilizingthe stored change from the transaction history.
 17. The computer programproduct of claim 14, further comprising: computer usable program codeconfigured to create an additional checkpoint in the transaction historywhile performing the physical synthesis; computer usable program codeconfigured to perform an additional change to the timing windowrepresenting the portion of the netlist; computer usable program codeconfigured to store the additional change in the transaction history;computer usable program code configured to determine that apost-additional change timing of the timing window representing theportion of the netlist is not an improvement over the pre-change timing;computer usable program code configured to restore the timing windowrepresenting the portion of the netlist to the checkpoint by retractingthe additional change utilizing the stored additional change from thetransaction history, retracting the change utilizing the stored changefrom the transaction history, and setting the post-additional changetiming of the timing window representing the portion of the netlist tothe pre-change timing utilizing the stored pre-change timing from thetransaction history.